Computing ULV Decomposition by Divide Conquer Method

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition

We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results using the algorithm first introduced in [34]. We propose a graph-based heuristic to find a suitable partitioning ...

Efficient Divide-And-Conquer Classification Based on Feature-Space Decomposition

This study presents a divide-and-conquer (DC) approach based on feature space decomposition for classification. When large-scale datasets are present, typical approaches usually employed truncated kernel methods on the feature space or DC approaches on the sample space. However, this did not guarantee separability between classes, owing to overfitting. To overcome such problems, this work propo...

Divide to conquer: decomposition methods for energy optimization

Divide-and-Conquer Algorithm for Computing Set Containment Joins

A set containment join is a join between set-valued attributes of two relations, whose join condition is speci ed using the subset ( ) operator. Set containment joins are used in a variety of database applications. In this paper, we propose a novel partitioning algorithm called Divide-and-Conquer Set Join (DCJ) for computing set containment joins eÆciently. We show that the divide-and-conquer a...